li=[7,6,5,4,3,2,1,11,12]
mid = len(li) // 2
pivot = li[mid]

def quiksort(li):
    if(len(li)<=1):
        return li
    mid=len(li)//2
    pivot=li[mid]

    left= [x for x in li if x < pivot]
    print(left)
    mide= [x for x in li if x == pivot]
    print(mide)
    right=[x for x in li if x > pivot]
    print(right)
    return quiksort(left) + mide + quiksort(right)

quiksort(li)